Laplace transform of certain functions with applications

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Laplace transform of certain functions with applications

The Laplace transform of the functions tν(1+ t)β, Reν > −1, is expressed in terms of Whittaker functions. This expression is exploited to evaluate infinite integrals involving products of Bessel functions, powers, exponentials, and Whittaker functions. Some special cases of the result are discussed. It is also demonstrated that the famous identity ∫∞ 0 sin(ax)/xdx =π/2 is a special case of our ...

متن کامل

Laplace Transform of Distribution-valued Functions and Its Applications

1. Notation and notions We repeat some definitions and facts, we need in our exposition but for special case. Let Q be an open set belonging to Rn. By D(Q) we denote the space {φ ∈ C∞(Q); suppφ ⊂ Kφ}, Kφ is a compact set in Q which depends on φ. D′(Q) is the space of continuous linear functionals on D(Q) the space of distributions. Every f ∈ Lloc(Q) defines a distribution, called regular distri...

متن کامل

Applications of convolution and‎ ‎subordination to certain $p$-valent functions

In this paper we considered some new classes of multivalent functions by using Aouf-Silverman-Srivastava operator and derived some important results using convolution and subordination technique. This new class is an extension of a class which introduced before.

متن کامل

Laplace Transform

We have seen before that Fourier analysis is very useful in the study of signals and linear and time invariant (LTI) systems. The main reason is that a lot of signals can be expressed as a linear combination of complex exponentials of the form e with s = jw. There are many properties that still apply when s is not restricted to be pure imaginary. That is why we introduce a generalization of the...

متن کامل

A Fast Laplace Transform Based on Laguerre Functions

In this paper, we present a fast algorithm which evaluates a discrete Laplace transform with N points at M arbitrarily distributed points in C(N + M) work, where C depends only on the precision required. Our algorithm breaks even with the direct calculation at N = M = 20, and achieves a speedup of 1000 with 10000 points. It is based on a geometric divide and conquer strategy, combined with the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences

سال: 2000

ISSN: 0161-1712,1687-0425

DOI: 10.1155/s0161171200001150